Displaying and Deciding Substructural Logics
نویسنده
چکیده
Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic (Belnap 1982). However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modiied proof theory which more closely models relevant logics. In addition, we use this proof theory to provide decidability proofs for a large range of substructural logics.
منابع مشابه
Displaying and Deciding Substructural Logics 1: Logics with Contraposition
Many logics in the relevant family can be given a proof theory in the style of Belnap's display logic (Belnap 1982). However, as originally given, the proof theory is essentially more expressive than the logics they seek to model. In this paper, we consider a modi ed proof theory which more closely models relevant logics. In addition, we use this proof theory to provide decidability proofs for ...
متن کاملSubstructural Logics and Residuated Lattices — an Introduction
This is an introductory survey of substructural logics and of residuated lattices which are algebraic structures for substructural logics. Our survey starts from sequent systems for basic substructural logics and develops the proof theory of them. Then, residuated lattices are introduced as algebraic structures for substructural logics, and some recent developments of their algebraic study are ...
متن کاملA Canonical Model Construction for Substructural Logics
In this paper, we introduce a class of substructural logics, called normal substructural logics, which includes not only relevant logic, BCK logic, linear logic and the Lambek calculus but also weak logics with strict implication, and de ne Kripkestyle semantics (Kripke frames and models) for normal substructural logics. Then we show a correspondence between axioms and properties on frames, and...
متن کاملModels for Substructural Arithmetics
This paper explores models for arithmetics in substructural logics. In the existing literature on substructural arithmetic, frame semantics for substructural logics are absent. We will start to fill in the picture in this paper by examining frame semantics for the substructural logics C (linear logic plus distribution), R (relevant logic) and CK (C plus weakening). The eventual goal is to find ...
متن کاملFuzzy Logics and Sub-structural Logics without Exchange
This report treats the relation between substructural logics and fuzzy logics, especially focuses on the noncommutativity of conjunctive operators i.e. substructural logics without the exchange rule. As the results, the authors show that fuzzy logics based on the left continuous pseudo-t-norms are the extensions of FLw. Also, we introduce the definition of pseudouninorms and give some methods t...
متن کامل